Deterministic regular expressions with back-references
نویسندگان
چکیده
منابع مشابه
Deterministic Regular Expressions With Back-References
Most modern libraries for regular expression matching allow back-references (i. e., repetition operators) that substantially increase expressive power, but also lead to intractability. In order to find a better balance between expressiveness and tractability, we combine these with the notion of determinism for regular expressions used in XML DTDs and XML Schema. This includes the definition of ...
متن کاملDeterministic Regular Expressions with Interleaving
We study the determinism checking problem for regular expressions extended with interleaving. There are two notions of determinism, i.e., strong and weak determinism. Interleaving allows child elements intermix in any order. Although interleaving does not increase the expressive power of regular expressions, its use makes the sizes of regular expressions be exponentially more succinct. We first...
متن کاملDeciding Definability by Deterministic Regular Expressions
We investigate the complexity of deciding whether a given regular language can be defined with a deterministic regular expression. Our main technical result shows that the problem is PSPACE-complete if the input language is represented as a regular expression or nondeterministic finite automaton. The problem becomes EXPSPACE-complete if the language is represented as a regular expression with c...
متن کاملFrom Regular Expressions to Deterministic Automata
The main theorem allows an elegant algorithm to be refined into an efficient one. The elegant algorithm for constructing a finite automaton from a regular expression is based on 'derivatives of' regular expressions; the efficient algorithm is based on 'marking of' regular expressions. Derivatives of regular expressions correspond to state transitions in finite automata. When a finite automaton ...
متن کاملRegular Expressions From Deterministic Finite Automata, Revisited
We continue our research on the conversion of deterministic finite automata to equivalent regular expressions from [H. Gruber, M. Holzer: Provably Shorter Regular Expressions from Deterministic Finite Automata. In: 12th DLT, Number 5257 of LNCS, 2008], where it was shown that every language over a binary alphabet accepted by an n-state deterministic finite automaton can be converted into an equ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2019
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2019.04.001